Self-stabilizing Asynchronous Phase Synchronization in General Graphs
نویسندگان
چکیده
The phase synchronization problem requires each node to infinitely transfer from one phase to the next one under the restriction that at most two consecutive phases can appear among all nodes. In this paper, we propose a self-stabilizing algorithm under the parallel execution model to solve this problem for semi-uniform systems of general graph topologies. The proposed algorithm is memory-efficient; its space complexity per node is O(logΔ + logK) bits, where Δ is the maximum degree of the system and K > 1 is the number of phases.
منابع مشابه
Size-Independent Self-Stabilizing Asynchronous Phase Synchronization in General Graphs
In this paper, we design a self-stabilizing phase synchronizer for distributed systems. The synchronizer enables a node transfer from one phase to the next one, subject to the condition that at most two consecutive phases can appear among all nodes. It does not rely on any system parameter like the number of nodes, and is thus fit for the system with dynamically changing number of nodes. Each n...
متن کاملPhase Clocks for Transient Fault Repair
Phase clocks are synchronization tools that implement a form of logical time in distributed systems. For systems tolerating transient faults by self-repair of damaged data, phase clocks can enable reasoning about the progress of distributed repair procedures. This paper presents a phase clock algorithm suited to the model of transient memory faults in asynchronous systems with read/write regist...
متن کاملA Fault-Resistant Asynchronous Clock Function
Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n > 12f), where the adversary is full-information and dynamic (sometimes called adaptive). In addition, the non-Byzantine nodes may undergo transient failures. Nodes advance in atomic steps, which consist of reading all registers, performing some calculatio...
متن کاملUnison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks
How to pass from local to global scales in anonymous networks? In such networks, how to organize a self-stabilizing propagation of information with feedback? From Angluin’s results, the deterministic leader election is impossible in general anonymous networks. Thus, it is impossible to build a rooted spanning tree. In this paper we show how to use Unison to design a selfstabilizing barrier sync...
متن کاملLinear Time Byzantine Self-Stabilizing Clock Synchronization
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessing self-stabilizing features are sensible and important requirements of distributed systems in general, and of a fundamental task such as clock synchronization in particular. There are efficient solutions for Byzantin...
متن کامل